منابع مشابه
Multilevel Optimization of Graph Bisection with Pheromones
We present a multiple ant-colony algorithm (MACA) for the graph bisection problem. The aim of this paper is to compare the performance of the MACA with results on the benchmark graphs from Graph partitioning Archive at the University of Greenwich. Experimental results show that the MACA is comparable with the state-of-the-art graph bisection algorithms.
متن کاملGraph bisection algorithms
In this thesis, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d > 3, all sufficiently large n and all b = o(ni-1/d2lJ), the algorithm finds...
متن کاملSolving Graph Bisection Problems with Semidefinite Programming
An exact solution method for the graph bisection problem is presented. We describe a branch-and-bound algorithm which is based on a cutting plane approach combining semideenite programming and polyhedral relax-ations. We report on extensive numerical experiments which were performed for various classes of graphs. The results indicate that the present approach solves general problem instances wi...
متن کاملSolving Graph Bisection Problems with Semidefinite
An exact solution method for the graph bisection problem is presented. We describe a branch-and-bound algorithm which is based on a cutting plane approach combining semideenite programming and polyhedral relax-ations. We report on extensive numerical experiments which were performed for various classes of graphs. The results indicate that the present approach solves general problem instances wi...
متن کاملGraph bisection revisited
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation for the graph bisection problem with a matrix variable of order n the number of vertices of the graph that is equivalent to the currently strongest semidefinit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2018
ISSN: 1084-6654,1084-6654
DOI: 10.1145/3173045